A smooth tool path planning method on NURBS surface based on the shortest boundary geodesic map

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computation of the shortest path between two curves on a parametric surface by geodesic-like method

In this paper, we present the geodesic-like algorithm for the computation of the shortest path between two objects on NURBS surfaces and periodic surfaces. This method can improve the distance problem not only on surfaces but in R. Moreover, the geodesic-like algorithm also provides an efficient approach to simulate the minimal geodesic between two holes on a NURBS surfaces.

متن کامل

A Method for Solving the Shortest Path on Curved Surface Based on Pso-sa Algorithm

Through the method of analyzing the intrinsic relationship of the nodal point series of the path on curved surface, circle arc approach method is put forward corresponding to the shortest path to solve the curved surface problem by local tuning. Particle swarm optimization has made faster development due to its easy understanding and implement. Particle swarm algorithm has strong local search a...

متن کامل

Improvement of the Shortest Path Problem with Geodesic-Like Method

This paper proposes a method to improve the shortest path problem on a NURBS (Non-uniform rational basis spline) surfaces. It comes from an application of the theory in classic differential geometry on surfaces and can improve the distance problem not only on surfaces but in the Euclidean 3-space R . Keywords—shortest paths, geodesic-like method, NURBS surfaces.

متن کامل

Shortest path planning on topographical maps

This thesis introduces a new algorithm for quickly answering repetitive least-cost queries between pairs of points on the Earth's surface as represented by digital topographical maps. The algorithm uses a three-step process; preprocessing, geometrically modified Dijkstra search, and postprocessing. The preprocessing step computes and saves highly valuable global information that describes the u...

متن کامل

Boundary knot method based on geodesic distance for anisotropic problems

The radial basis function (RBF) collocation techniques for the numerical solution of partial differential equation problems are increasingly popular in recent years thanks to their striking merits being inherently meshless, integration-free, and highly accurate. However, the RBF-based methods have markedly been limited to handle isotropic problems due to the use of the isotropic Euclidean dista...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Manufacturing Processes

سال: 2020

ISSN: 1526-6125

DOI: 10.1016/j.jmapro.2020.08.047